Correctness of a classic sorting algorithm of linear time complexity and realization of radix sorting were proved and the time complexity of it was analyzed from the viewpoint of the "big-O notation". Comparison of runtime between radix sorting and other classic sorting algorithms was performed. 采用大O表示法客观地分析了基数排序算法的时间复杂度,给出了基数排序算法的实现和正确性的证明,并与比较排序算法作了横向的运行时间的对比。
In this paper, radix and numerals of the place value notation extend from positive number to negative number, and form into a new theorem. 本文将位值计数法中的基数和数码从正整数推广到负整数,并得出一条新的定理。